ABSTRACT The use of the Multicriteria Decision Support Hybrid Algorithm for Decision Making Processes with Discrete Alternatives, acronym THOR, requires from the decision maker, during the judgment insertion stage, a significant amount of information that needs to be valued, which may cause the decision maker great cognitive fatigue. Therefore, this article aims to reformulate the THOR algorithm, in the judgment insertion stage, based on the inclusion of a fuzzy measurement scale, allowing the decision maker to express only a single value judgment. This reformulation follows the three steps of a fuzzy system: fuzzification, fuzzy inference and defuzzification. In addition, a comparative analysis is performed between the THOR algorithm and its new version based on the construction of the fuzzy scale. It should be noted that its reformulation does not compromise the methodological efficiency of the THOR algorithm, it only reduces the complexity of decision making.

ABSTRACT This paper describes a plan to develop a prioritization model of efficiency indicators to evaluate the services provided by seaports to ships in terms ofeconomicity, quality, and reliability. The methodology adopted is applied research, using a case study carried out in a Brazilian seaport. The approach used as an intervention tool in the elaboration of the model is the Fuzzy-Analytical Hierarchy Process. The results suggest the prioritization of economicity over the other two criteria of reliability and quality.

ABSTRACT The simulated annealing (SA) and genetic algorithm (GA) metaheuristics are comparatively applied to the berth allocation problem (BAP) of a port container terminal. By synthesizing the experimental studies of the BAP available in the literature, the two methods are compared when applied to the same case. For this purpose, six test problems are considered, where SA and GA are compared using four crossover operators. Once the optimal GA crossover operator is determined, computational tests are performed with the data obtained at the port terminal to compare the performance of the two metaheuristics.

O presente trabalho propõe um modelo heurístico de resolução para a melhoria do Serviço de Estacionamento Rotativo Regulamentado na cidade de Rio Grande-RS, baseado na formação de agrupamentos (clusters). Tem como objetivo, obter de forma eficaz e eficiente os setores e áreas de fiscalização no estacionamento rotativo. A metodologia apresentada utiliza técnicas da pesquisa operacional e divide o trabalho em três fases: na primeira é feita uma pesquisa de campo; na segunda são formados os setores de fiscalização e na terceira são formadas as áreas do estacionamento rotativo. Para a formação dos setores, foi utilizado comparativamente a heurística clássica Teitz e Bart e Busca Tabu definindo assim, as p-medianas necessárias para o problema. Estas medianas servem como "sementes" para a formação dos setores de fiscalização, obtidos através do algoritmo de designação de Gillett e Johnson. Um aplicativo dinâmico processa os dados georreferenciados tornando possível a informatização do atual sistema, bem como permite analisar os diferentes mapas que podem ser obtidos a partir da construção de cenários, quando os trechos de quadra são adicionados ou removidos ou ainda da contratação ou redução de pessoal.

The present work proposes a heuristic model of solution to improve the regulated Rotating Parking Lot Service situated in Rio Grande, Brazil, based on the formation of the clusters. It has as a goal to obtain an effective and efficient way the sectors and areas of inspection in the rotating parking lot. The methodology uses techniques of operational research and divides the work in three phases: first, a field research is performed; second, sectors of inspection are formed; and third, the areas of the rotating parking lot are formed. To the sectors formation, it was used comparatively the classic heuristic Teitz and Bart and Tabu Search defining that way the p-median needed to the problem. These medians are used as "seeds" to the formation of the inspection sector, obtained by the designation algorithm of Gillet and Johnson. A dynamic application processed the georeferenced data making possible the computerization of the current system, as well as allowing the analysis of the different maps that may be obtained from the building of scenarios, when the block stretches are added or removed or still from the recruitment or reduction of people.

Este trabalho apresenta uma heurística baseada no Simulated Annealing para resolver o Problema de Alocação de Berços. Esse problema aborda a programação e a alocação de navios às áreas de atracação ao longo de um cais. O problema é modelado como um Problema de Roteamento de Veículos com Múltiplas Garagens e Janelas de Tempo. Para aplicação do Simulated Annealing foi desenvolvido um software, possibilitando realizar cenários mais próximos das atividades praticadas nos portos. Os resultados computacionais são obtidos através de problemas testes com dados reais do Terminal de Contêineres Tecon Rio Grande.

This work presents a Simulated Annealing based heuristic to solve the Berth Allocation Problem. This problem approaches the programming and allocation of ships to mooring areas along a quay. The problem is modeled as a Multi-Depot Vehicle Routing Problem with Time Windows. For application of Simulated Annealing, software was developed, enabling scenarios closest to perform activities practiced in ports. The computational results are obtained through test problems with real data from the Container Terminal Tecon Rio Grande.